Lower bounds on the DNF exception problem for short exception lists and related problems

نویسنده

Yura Maximov

چکیده

In this paper we prowide lower bounds on the complexity of the DNF exception problem for short exception lists and hypercube covering problem. The method proposed is based on the relaxation of the initial problem to a certain linear programming problem. Some explicit bounds are provided for the case when exception list size is bounded above by a logarithm of dimension. The bound provided in this case is significantly stronger than the bounds known before.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The DNF exception problem

Given a disjunctive normal form (DNF) expression φ and a set A of vectors satisfying the expression, called the set of exceptions, we would like to update φ to get a new DNF which is false on A, and otherwise is equivalent to φ. Is there an algorithm with running time polynomial in the number of variables, the size of the original formula and the number of exceptions, which produces an updated ...

متن کامل

Symmetric Approximation Arguments for Monotone Lower Bounds without Sun owers

We propose a symmetric version of Razborov's method of approximation to prove lower bounds for monotone circuit complexity. Traditionally, only DNF formulas have been used as approximators, whereas we use both CNF and DNF formulas. As a consequence we no longer need the Sun-ower lemma that has been essential for the method of approximation. The new approximation argument corresponds to Haken's ...

متن کامل

E-Waste-Concept, Problems and Solution Policies in India

Electronic waste or E-waste is relatively a novel addition to the ever-growing hazardous waste stream. It includes discarded electronic and electrical equipment. Developing countries face enormous challenges which are related to the generation and management of E-waste which are either internally generated or imported illegally; India is no exception. However, the existing managemen...

متن کامل

Net Present Value of Cash Flows in Single Machine and Flow Shop Scheduling Problems

While a great portion of the scheduling literature focuses on time-based criteria, the most important goal of management is maximizing the profitability of the firm. In this paper, the net preset value criterion is studied taking account of linear time-dependent cash flows in single machine and flow shop scheduling problems. First, a heuristic method is presented for the single machine scheduli...

متن کامل